Regular Expressions with Lookahead
نویسندگان
چکیده
This paper investigates regular expressions which in addition to the standard operators of union, concatenation, and Kleene star, have lookaheads . We show how translate with ( REwLA ) equivalent Boolean automata having at most 3 states more than length also investigate state complexity when translating deterministic finite (DFA).
منابع مشابه
RDF with regular expressions
RDF is a knowledge representation language dedicated to the annotation of resources within the framework of the semantic web. Among the query languages for querying an RDF knowledge base, some, such as SPARQL, are based on the formal semantics of RDF and the concept of semantic consequence, others, inspired by the work in databases, use regular expressions making it possible to search the paths...
متن کاملDeterministic Regular Expressions with Interleaving
We study the determinism checking problem for regular expressions extended with interleaving. There are two notions of determinism, i.e., strong and weak determinism. Interleaving allows child elements intermix in any order. Although interleaving does not increase the expressive power of regular expressions, its use makes the sizes of regular expressions be exponentially more succinct. We first...
متن کاملDegrees of Lookahead in Regular Infinite Games
We study variants of regular infinite games where the strict alternation of moves between the two players is subject to modifications. The second player may postpone a move for a finite number of steps, or, in other words, exploit in his strategy some lookahead on the moves of the opponent. This captures situations in distributed systems, e.g. when buffers are present in communication or when s...
متن کاملSymbolic String Transformations with Regular Lookahead and Rollback
Implementing string transformation routines, such as encoders, decoders, and sanitizers, correctly and efficiently is a difficult and error prone task. Such routines are often used in security critical settings, process large amounts of data, and must work efficiently and correctly. We introduce a new declarative language called Bex that builds on elements of regular expressions, symbolic autom...
متن کاملDescribing Syntax with Star-Free Regular Expressions
Syntactic constraints in Koskenniemi's Finite-State Intersection Grammar (FSIG) are logically less complex than their formalism (Koskenniemi et al., 1992) would suggest: It turns out that although the constraints in Voutilainen's (1994) FSIG description of English make use of several extensions to regular expressions, the description as a whole reduces to a finite combination of union, compleme...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Universal Computer Science
سال: 2021
ISSN: ['0948-695X', '0948-6968']
DOI: https://doi.org/10.3897/jucs.66330